#ifndef SEARCH_H
#define SEARCH_H

int sequential_search(int data[], int size, int key);
int binary_search(int data[],int size, int key);

typedef struct bst_node{
    int data;
    struct bst_node *lchild, *rchild;
}bst_node,*bs_tree;
int bst_insert(bs_tree *bst, int data);
bs_tree bst_create(int data[], int size);
bst_node *bst_search(bs_tree bst, int data);
int bst_delete_node(bs_tree *bst, int data);
void bst_free(bs_tree bst);

#endif
